import java.io.File;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.Set;


public class Prims {
	public static void main(String[] args) {
		//creating binary heap table
		KeyboardReader read = new KeyboardReader();
		String directory = "data";
		SimpleGraph g = new SimpleGraph();
		Hashtable t = GraphInput.LoadSimpleGraph(g, directory);
//		Iterator itr = g.vertices();
		Set<Object> temp = t.keySet();
		Object startingVertex = (temp.iterator()).next();
		temp.remove(startingVertex);
		for (Object vertexName : t.keySet()) {
			Vertex tmp = (Vertex) t.get((String) vertexName);
			t.put((String) vertexName, Double.MAX_VALUE);
		}
		
		
		//assume all Vertices set to infinity except for one
		//which is set to zero and that 
		
		PrimsSimpleGraph pg = new PrimsSimpleGraph();
		//pg.
		
	}
}
